Some Characteristics Of Ng-Groups
نویسندگان
چکیده
The This paper aims to consider and study some new properties in NG groups that consist of non-bijective transformations are not a subset symmetric groups. regularity these presents such as results. Moreover, definition anti-inverse is given. Some results studied.
منابع مشابه
Some properties of marginal automorphisms of groups
AbstractLet W be a non-empty subset of a free group. The automorphism of a group G is said to be a marginal automorphism, if for all x in G,x^−1alpha(x) in W^*(G), where W^*(G) is the marginal subgroup of G.In this paper, we give necessary and sufficient condition for a purelynon-abelian p-group G, such that the set of all marginal automorphismsof G forms an elementary abelian p-group.
متن کاملRATIONAL CHARACTER TABLE OF SOME FINITE GROUPS
The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...
متن کاملNSE characterization of some linear groups
For a finite group $G$, let $nse(G)={m_kmid kinpi_e(G)}$, where $m_k$ is the number of elements of order $k$ in $G$ and $pi_{e}(G)$ is the set of element orders of $G$. In this paper, we prove that $Gcong L_m(2)$ if and only if $pmid |G|$ and $nse(G)=nse(L_m(2))$, where $min {n,n+1}$ and $2^n-1=p$ is a prime number.
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ???? ?????? ?????? ??????????
سال: 2022
ISSN: ['2708-8251', '2521-9200']
DOI: https://doi.org/10.51984/jopas.v21i4.2115